Multiobjective evolutionary algorithms for context-based search

نویسندگان

  • Rocío L. Cecchini
  • Carlos M. Lorenzetti
  • Ana Gabriela Maguitman
  • Nélida Beatriz Brignole
چکیده

Formulating high-quality queries is a key aspect of context-based search. However, determining the effectiveness of a query is challenging because multiple objectives, such as high precision and high recall, are usually involved. In this work we study techniques that can be applied to evolve contextualized queries when the criteria for determining query quality are based on multiple objectives. We report on the results of three different strategies for evolving queries: (1) single-objective, (2) multi-objective with Pareto-based ranking, and (3) multi-objective with aggregative ranking. After a comprehensive evaluation with a large set of topics we discuss the limitations of the singleobjective approach and observe that both the Pareto-based and aggregative strategies are highly effective for evolving topical queries. In particular, our experiments lead us to conclude that the multi-objective techniques are superior to a baseline as well as to well-known and ad-hoc query reformulation techniques.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pareto-based Cost Simulated Annealing for Multiobjective Optimization

In this paper, a multiobjective simulated annealing (MOSA) method is introduced and discussed with the multiobjective evolutionary algorithms (MOEAs). Though the simulated annealing is a very powerful search algorithm and has shown good results in various singleobjective optimization fields, it has been seldom used for the multiobjective optimization because it conventionally uses only one sear...

متن کامل

Multiobjective Simulated Annealing: A Comparative Study to Evolutionary Algorithms

As multiobjective optimization problems have many solutions, evolutionary algorithms have been widely used for complex multiobjective problems instead of simulated annealing. However, simulated annealing also has favorable characteristics in the multimodal search. We developed several simulated annealing schemes for the multiobjective optimization based on this fact. Simulated annealing and evo...

متن کامل

Robustness in Hypervolume-based Multiobjective Search

The use of quality indicators within the search has become a popular approach in the field of evolutionary multiobjective optimization. It relies on the concept to transform the original multiobjective problem into a set problem that involves a single objective function only, namely a quality indicator, reflecting the quality of a Pareto set approximation. Especially the hypervolume indicator h...

متن کامل

Pareto-based continuous evolutionary algorithms for multiobjective optimization

In an attempt to solve multiobjective optimization problems, many traditional methods scalarize an objective vector into a single objective by a weight vector. In these cases, the obtained solution is highly sensitive to the weight vector used in the scalarization process and demands a user to have knowledge about the underlying problem. Moreover, in solving multiobjective problems, designers m...

متن کامل

Evolutionary Multiobjective Optimization for Fuzzy Knowledge Extraction

− A new trend in the design of fuzzy rulebased systems is the use of evolutionary multiobjective optimization (EMO) algorithms. This trend is observed in various areas in machine learning. EMO algorithms are often used to search for a number of Pareto-optimal non-linear systems with respect to their accuracy and complexity. In this paper, we first explain some basic concepts in multiobjective o...

متن کامل

A New Hybrid Evolutionary Multiobjective Algorithm Guided by Descent Directions

Hybridization of local search based algorithms with evolutionary algorithms is still an under-explored research area in multiobjective optimization. In this paper, we propose a new multiobjective algorithm based on a local search method. The main idea is to generate new non-dominated solutions by adding a linear combination of descent directions of the objective functions to a parent solution ....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JASIST

دوره 61  شماره 

صفحات  -

تاریخ انتشار 2010